Particle RRT for Path Planning in Very Rough Terrain
نویسندگان
چکیده
The Particle-based Rapidly-exploring Random Tree (pRRT) algorithm is a new method for planetary rover path planning in very rough terrain. The Rapidly-exploring Random Tree algorithm is a planning technique that accounts for effects such as vehicle dynamics by incrementally building a tree of reachable states. pRRT extends the conventional RRT algorithm by explicitly considering uncertainty in sensing, modeling, and actuation by treating each addition to the tree as a stochastic process. The pRRT algorithm has been experimentally verified in simulation, and shown to produce plans that are significantly more robust than conventional RRT. Our recent work has investigated several vehicle models to improve the performance and accuracy of the pRRT algorithm in simulation. Based on these results, we have integrated the simulator with the iRobot ATRV-Jr hardware platform and tested and verified the pRRT algorithm using IPC communication.
منابع مشابه
Motion Planning for Bounding on Rough Terrain with the LittleDog Robot
In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot that has 12 actuators, and a 36-dimensional state space; the task of bounding involves differential contstraints due to underactuation and motor limits, which makes motion planning extremely challenging. Rapidly-exploring...
متن کاملCombining Cost and Reliability for Rough Terrain Navigation
This paper presents an improved method for planetary rover path planning in very rough terrain, based on the particle-based Rapidly-exploring Random Tree (pRRT) algorithm. It inherits the benefits of pRRT, an improvement over the conventional RRT algorithm that explicitly considers uncertainty in sensing, modeling, and actuation by treating each addition to the tree as a stochastic process. Alt...
متن کاملRough Terrain Motion Planning for Actuated, Tracked Robots
Traversing challenging structures like boulders, rubble, stairs and steps, mobile robots need a special level of mobility. Robots with reconfigurable chassis are able to alter their configuration to overcome such structures. This paper presents a two-stage motion planning scheme for reconfigurable robots in rough terrain. First, we consider the robot’s operating limits rather than the complete ...
متن کاملSample-based motion planning in high-dimensional and differentially-constrained systems
State of the art sample-based path planning algorithms, such as the Rapidly-exploring Random Tree (RRT), have proven to be effective in path planning for systems subject to complex kinematic and geometric constraints. The performance of these algorithms, however, degrade as the dimension of the system increases. Furthermore, sample-based planners rely on distance metrics which do not work well ...
متن کاملBounding on rough terrain with the LittleDog robot
A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled as a planar five-link system, with a 16-dimensional state space; computing a plan over rough terrain in this high-dimensional state space that respects the kinodynamic cons...
متن کامل